Mining the optimal class association rule set
نویسندگان
چکیده
منابع مشابه
Mining the optimal class association rule set
We define an optimal class association rule set to be the minimum rule set with the same predictive power of the complete class association rule set. Using this rule set instead of the complete class association rule set we can avoid redundant computation that would otherwise be required for mining predictive association rules and hence improve the efficiency of the mining process significantly...
متن کاملSoft set based association rule mining
Association rules, one of the most useful constructs in data mining, can be exerted to capture interesting dependencies between variables in large datasets. Herawan and Deris initiated the investigation of mining association rules from transactional datasets using soft set theory. Unfortunately, some existing concepts in the literature were unable to realize properly Herawan and Deris’s initial...
متن کاملMining the Smallest Association Rule Set for Predictions
Mining transaction databases for association rules usually generates a large number of rules, most of which are unnecessary when used for subsequent prediction. In this paper we define a rule set for a given transaction database that is much smaller than the association rule set but makes the same predictions as the association rule set by the confidence priority. We call this subset the inform...
متن کاملAssociation Rule Mining Algorithms for Set-Valued Data
This paper presents an association rule mining system that is capable of handling set-valued attributes. Our previous research has exposed us to a variety of real-world biological datasets that contain attributes whose values are sets of elements, instead of just individual elements. However, very few data mining tools accept datasets that contain these set-valued attributes, and none of them a...
متن کاملDecentralized Association Rule Mining on Web Using Rough Set Theory
A central part of many algorithms for mining association rules in large data sets is a procedure that is to find so called frequent itemsets. The frequent itemsets are very large due to transactions data increasing. This paper proposes a new approach to find frequent itemsets employing rough set theory that can extract association rules for each homogenous cluster of transaction data records an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Knowledge-Based Systems
سال: 2002
ISSN: 0950-7051
DOI: 10.1016/s0950-7051(02)00024-2